Delaunay Triangulation Based Surface Reconstruction: Ideas and Algorithms

نویسندگان

  • Frédéric Cazals
  • Joachim Giesen
چکیده

Given a finite sampling P ⊂ R of an unknown surface S, surface reconstruction is concerned with the calculation of a model of S from P . The model can be represented as a smooth or a triangulated surface, and is expected to match S from a topological and geometric standpoints. In this survey, we focus on the recent developments of Delaunay based surface reconstruction methods, which were the first methods (and in a sense still the only ones) for which one can precisely state properties of the reconstructed surface. We outline the foundations of these methods from a geometric and algorithmic standpoints. In particular, a careful presentation of the hypothesis used by these algorithms sheds light on the intrinsic difficulties of the surface reconstruction problem —faced by any method, Delaunay based or not. Key-words: Reverse engineering, Shape approximation, Surface reconstruction, Delaunay, Voronöı ∗ Project Geometrica, INRIA Sophia † Departement Informatik, ETH Zürich, Switzerland Reconstruction de surfaces avec la triangulation de Delaunay: idées forces et algorithmes Résumé : Etant donné un ensemble de points P ⊂ R échantillonnés sur une surface (inconnue) S, la reconstruction de surface a pour objet le calcul d’un modèle de S à partir de P . Ce modèle peut être représenté par surface triangulée ou une surface lisse, et doit respecter les propriétés géométriques et topologiques de S. Ce survey a pour objet une présentation des méthodes récentes de reconstruction utilisant la triangulation de Delaunay, méthodes qui ont été les premières pour lesquelles des preuves sur les qualités de la surface reconstruite ont été données. Nous examinons les fondements géométriques mais aussi algorithmiques de ces méthodes. En particulier, un examen minutieux des hypothèses utilisées par ces algorithmes met en évidence les difficultés intrinsèques de la reconstruction de surface, difficultés auxquelles doivent faire face tous les algorithmes —utilisant la triangulation de Delaunay ou pas. Mots-clés : Ingenierie inverse, Approximation de formes, Reconstruction de surface, Delaunay, Voronöı Delaunay Triangulation Based Surface Reconstruction 3

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Shape Reconstruction and Recognition with Isolated Non-directional Cues

The paper investigates a hypothesis that our visual system groups visual cues based on how they form a surface, or more specifically triangulation derived from the visual cues. To test our hypothesis, we compare shape recognition with three different representations of visual cues: a set of isolated dots delineating the outline of the shape, a set of triangles obtained from Delaunay triangulati...

متن کامل

Reconstruction of Virtual Parts from Unorganized Scanned Data for Automated Dimensional Inspection

In the framework of Virtual CMM [1], virtual parts are proposed to be constructed as triangulated surface models. This paper presents a novel surface reconstruction method to the creation of virtual parts. It is based on the idea of identification and sculpting of concave regions of a Delaunay triangulation of the sample data. The proposed algorithm is capable of handling the reconstruction of ...

متن کامل

Review on Surface Reconstruction Algorithms

Surface reconstruction is to find a surface from a given finite set of geometric sample value. Surface reconstructing 3D surfaces from point samples is a well studied problem in computer graphics. All algorithms, aim to solve this problem must overcome several difficulties. One of which is related to the size and quality of the input, under sampling, and noise. The main aim of this research pap...

متن کامل

A Delaunay-based region-growing approach to surface reconstruction from unorganized points

This paper presents a Delaunay-based region-growing (DBRG) surface reconstruction algorithm that holds the advantages of both Delaunay-based and region-growing approaches. The proposed DBRG algorithm takes a set of unorganized sample points from the boundary surface of a threedimensional object and produces an orientable manifold triangulated model with a correct geometry and topology that is f...

متن کامل

Efficient surface reconstruction from contours based on two-dimensional Delaunay triangulation

This paper introduces an efficient method for surface reconstruction from sectional contours. The surface between neighbouring sections is reconstructed based on the consistent utilization of the twodimensional constrained Delaunay triangulation. The triangulation is used to extract the parametric domain and to solve the problems associated with correspondence, tiling and branching in a general...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004